The Duffin–Schaeffer theorem in number fields
نویسندگان
چکیده
منابع مشابه
Prime Number Theorem for Algebraic Function Fields
Elementary proofs of the abstract prime number theorem of the form A(w) = qm + 0(qmm~i) for algebraic function fields are given. The proofs use a refinement of a tauberian theorem of Bombieri. 0. Introduction The main purpose of this paper is to give elementary proofs of the abstract prime number theorem for algebraic function fields (henceforth, the P.N.T.) which was established in the author'...
متن کاملA Bombieri-vinogradov Theorem for All Number Fields
Abstract. The classical theorem of Bombieri and Vinogradov is generalized to a non-abelian, non-Galois setting. This leads to a prime number theorem of “mixed-type” for arithmetic progressions “twisted” by splitting conditions in number fields. One can view this as an extension of earlier work of M. R. Murty and V. K. Murty on a variant of the Bombieri-Vinogradov theorem. We develop this theory...
متن کاملAn Elemental Erdős–kac Theorem for Algebraic Number Fields
Abstract. Fix a number field K. For each nonzero α ∈ ZK , let ν(α) denote the number of distinct, nonassociate irreducible divisors of α. We show that ν(α) is normally distributed with mean proportional to (log log |N(α)|)D and standard deviation proportional to (log log |N(α)|)D−1/2. Here D, as well as the constants of proportionality, depend only on the class group of K. For example, for each...
متن کاملThe Prime Number Theorem
The Prime Number Theorem asserts that the number of primes less than or equal to x is approximately equal to x log x for large values of x (here and for the rest of these notes, log denotes the natural logarithm). This quantitative statement about the distribution of primes which was conjectured by several mathematicians (including Gauss) early in the nineteenth century, and was finally proved ...
متن کاملThe Perfect Number Theorem and Wilson's Theorem
This article formalizes proofs of some elementary theorems of number theory (see [1, 26]): Wilson’s theorem (that n is prime iff n > 1 and (n − 1)! ∼= −1 (mod n)), that all primes (1 mod 4) equal the sum of two squares, and two basic theorems of Euclid and Euler about perfect numbers. The article also formally defines Euler’s sum of divisors function φ, proves that φ is multiplicative and that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2020
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa181030-9-3